Disjunctive Logic Programming and Possible Model Semantics
نویسندگان
چکیده
We use Kripke structures of autoepistemic logic to classify various semantics for disjunctive logic programs with default negation. We have observed that nonmonotonic reasoning can be characterized by Kripke structures whose beliefs are justiied. We also observed that two diierent types of negative introspection in autoepistemic reasoning present two diierent interpretations of default negation: consistency-based and minimal-model-based; we further observed that all logic program semantics fall into three semantical points of view: the skeptical, stable, and partial-stable. Based on these observations, we classify dis-junctive logic program semantics into six diierent categories, and discuss the relationships among various semantics.
منابع مشابه
Abductive logic programming and disjunctive logic programming: their relationship and transferability
Abductive logic programming (ALP) and disjunctive logic programming (DLP) are two different extensions of logic programming. This paper investigates the relationship between ALP and DLP from the program transformation viewpoint. It is shown that the belief set semantics of an abductive program is expressed by the answer set semantics and the possible model semantics of a disjunctive program. In...
متن کاملMulti-paradigm Logic Programming
A disjunctive temporal logic programming language, called Disjunctive Chronolog is presented in this paper. Disjunctive Chronolog combines the ideas of both temporal logic programming and disjunctive logic programming. The new language is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. Minimal model semantics, model ...
متن کاملArgumentation-based abduction in disjunctive logic programming
In this paper we propose an argumentation-based semantic framework , called DAS, for disjunctive logic programming. The basic idea is to translate a disjunctive logic program into an argumentation-theoretic framework. One unique feature of our proposed framework is to consider the disjunctions of negative literals as possible assumptions so as to represent incomplete information. In our framewo...
متن کاملNegation in Disjunctive Logic Programs
In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We de ne new rules, the GCWA : and the WGCWA : , which are natural extensions of the GCWA and the WGCWA. Second, we introduce a new semantics called the possible world semantics for general dis...
متن کاملProgression Semantics for Disjunctive Logic Programs
In this paper, we extend the progression semantics for firstorder disjunctive logic programs and show that it coincides with the stable model semantics. Based on it, we further show how disjunctive answer set programming is related to Satisfiability Modulo Theories.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998